Search results for "design [accelerator]"
showing 10 items of 594 documents
Il tempo sospeso del processo interrotto: oltre la rimozione, un futuro per l’incompiuto
2020
Gli esiti di processi edilizi interrotti sono ascrivibili a una categoria di ambiente costruito anomala, che offre un banco di prova importante per la progettazione tecnologica dell’architettura. Infatti, il finalismo incentrato sul conseguimento di obiettivi e la visione lineare del tempo entrano in crisi a fronte di costruzioni il cui ciclo di vita non ha mai preso avvio, irriducibilmente estranee al presente e il cui futuro è controverso. Il fenomeno bipolare dell’incompiuto offre il quadro a interpretazioni dei suoi legami con la variabile tempo, intesa come fattore di trasformazione e perno del progetto architettonico. Considerandone la diffusione e l’evoluzione, si può delineare per l…
IPR gender gaps: a first look at utility model, design right and trademark filings
2018
This study extends the analysis of the gender gap in patenting into design rights, utility model (UMs) and trademarks (TMs), which are complementary methods for protecting intellectual property. The analysis is descriptive and uses register data from the Finnish patent and registration office covering the years 1982–2013. A persistent gender gap is found for all intellectual property rights. The gap has narrowed over time for national patent, design right and TM filings but not for UM filings. It is found that, in comparison to men, women are relatively less often single inventors or designers and more often members of inventor or designer teams. peerReviewed
Testing experimental designs in liquid chromatography (II): Influence of the design geometry on the prediction performance of retention models.
2021
Abstract In liquid chromatography, the reliability of predictions carried out with retention models depends critically on the quality of the training experimental design. The search of the best design is more complex when gradient runs are used instead of isocratic experiments. In Part I of this work (JCA 1624 (2020) 461180), a general methodology based on the error propagation theory was developed and validated for assessing the quality of training designs involving gradients. The treatment relates the mathematical properties of a retention model with the geometry of the training designs and their subsequent predictions. In that work, only five usual designs were considered. Part II invest…
Communal Transportation: Challenges for Largescale Routing Heuristics
2007
In this report we review the central transportation logistics problems arising in the communal sector, using information gathered from several large communes in Finland and previous literature. Most of the communal transportation problems can be modelled as different variants of the vehicle routing problem. The basic features of the problems are described, modelled and analyzed, and the relevant previous research on the topics is reviewed. In addition, some possible new solution strategies are suggested.
Understanding Safety-Related Issues for Pedestrians at Modern Roundabouts
2012
This paper examines the safety-related issues for pedestrians at modern roundabouts. For this purpose findings of research studies documented in the scientific literature and best practices have been examined trying to focus on roundabout installations by a pedestrians safety perspective. Whereas one of the main reasons for which roundabouts are built is related to safety benefits, roundabout design features and implications in road casualties have been commented first to evaluate the influence of roundabouts on pedestrian safety and then to identify design elements that have such a high potential for traffic safety. At last, measures and treatments that can be taken in the roundabouts desi…
Optimal Transit Network Design
2019
In this chapter, the optimal transit network design is under investigation. A special kind of transport is assumed to be given the best traffic conditions in a road network (the smallest amount of travel time between origins and destinations). Optimality criteria for transit network design in case of selfish routing are defined in the first section. The Sect. 7.2 is devoted to the estimation of selfish traffic assignment in a network with a transit subnetwork. Optimality criteria for transit network design in case of competitive drivers’ groups routing are defined in the Sect. 7.3. The Sect. 7.4 is devoted to traffic assignment in case of competitive drivers’ groups routing in a network wit…
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
2011
Abstract: The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.
Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
2020
Abstract This paper studies the vehicle routing and truck driver scheduling problem where routes and schedules must comply with hours of service regulations for truck drivers. It presents a backward labeling method for generating feasible schedules and shows how the labels generated with the backward method can be combined with labels generated by a forward labeling method. The bidirectional labeling is embedded into a branch-and-price-and-cut approach and evaluated for hours of service regulations in the United States and the European Union. Computational experiments show that the resulting bidirectional branch-and-price-and-cut approach is significantly faster than unidirectional counterp…
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
2016
International audience; In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequaliti…
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
2018
In this paper, we present a new branch-and-price-and-cut algorithm to solve the truck-and-trailer routing problem with time windows (TTRPTW) and two real-world extensions. In all TTRPTW variants, the fleet consists of one or more trucks that may attach a trailer. Some customers are not accessible with a truck-and-trailer combination, but can however be serviced by one if the trailer is previously detached and parked at a suitable location. In the first extension, the planning horizon comprises two days and customers may be visited either on both days or only once, in which case twice the daily supply must be collected. The second extension incorporates load transfer times depending on the …